منابع مشابه
Slim sets of binary trees
A classical problem in phylogenetic tree analysis is to decide whether there is a phylogenetic tree T that contains all information of a given collection P of phylogenetic trees. If the answer is “yes” we say that P is compatible and T displays P . This decision problem is NP-complete even if all input trees are quartets, that is binary trees with exactly four leaves. In this paper, we prove a ...
متن کاملFast Indexing and Visualization of Metric Data Sets using Slim-Trees
ÐMany recent database applications must deal with similarity queries. For such applications, it is important to measure the similarity between two objects using the distance between them. Focusing on this problem, this paper proposes the Slim-tree, a new dynamic tree for organizing metric data sets in pages of fixed size. The Slim-tree uses the triangle inequality to prune distance calculations...
متن کاملSlim-Trees: High Performance Metric Trees Minimizing Overlap Between Nodes
In this paper we present the Slim-tree, a dynamic tree for organizing metric datasets in pages of fixed size. The Slim-tree uses the "fat-factor" which provides a simple way to quantify the degree of overlap between the nodes in a metric tree. It is well-known that the degree of overlap directly affects the query performance of index structures. There are many suggestions to reduce overlap in m...
متن کاملCantor Sets, Binary Trees and Lipschitz Circle Homeomorphisms
We define the notion of rotations on infinite binary trees, and construct an irrational tree rotation with bounded distortion. This lifts naturally to a Lipschitz circle homeomorphism having the middle-thirds Cantor set as its minimal set. This degree of smoothness is best possible, since it is known that no C1 circle diffeomorphism can have a linearly self-similar Cantor set as its minimal set.
متن کاملRedescription Mining Over non-Binary Data Sets Using Decision Trees
Scientific data mining is aimed to extract useful information from huge data sets with the help of computational efforts. Recently, scientists encounter an overload of data which describe domain entities from different sides. Many of them provide alternative means to organize information. And every alternative data set offers a different perspective onto the studied problem. Redescription minin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 2012
ISSN: 0097-3165
DOI: 10.1016/j.jcta.2011.09.007